Knot graphs
نویسندگان
چکیده
We consider the equivalence classes of graphs induced by the unsigned versions of the Reidemeister moves on knot diagrams. Any graph which is reducible by some finite sequence of these moves, to a graph with no edges is called a knot graph. We show that the class of knot graphs strictly contains the set of delta-wye graphs. We prove that the dimension of the intersection of the cycle and cocycle spaces is an effective numerical invariant of these classes.
منابع مشابه
Intrinsic Linking and Knotting in Virtual Spatial Graphs
We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that these filtrations are descending and non-terminating. We also provide several examples of intrinsically virtually linked and knotted graphs. As a byproduct, ...
متن کاملTutte Polynomials of Tensor Products of Signed Graphs and Their Applications in Knot Theory
It is well-known that the Jones polynomial of an alternating knot is closely related to the Tutte polynomial of a special graph obtained from a regular projection of the knot. Relying on the results of Bollobás and Riordan, we introduce a generalization of Kauffman’s Tutte polynomial of signed graphs for which describing the effect of taking a signed tensor product of signed graphs is very simp...
متن کاملLune-Free Knot Graphs
and Dedication This paper is an exploration of simple four-regular graphs in the plane (i.e. loopless and with no more than one edge between any two nodes). Such graphs are fundamental to the theory of knots and links in three dimensional space, and their planar diagrams. We dedicate this paper to Frank Harary (1921 – 2005) whose fascination with graphs of knots inspired this work and with whom...
متن کاملTopological Realizations of Ortho-projection Graphs
We discuss the production of ortho-projection graphs from alternating knot diagrams, and introduce a more general construction of such graphs from “splittings” of closed, non-orientable surfaces. As our main result, we prove that this new topological construction generates all ortho-projection graphs. We present a minimal example of an ortho-projection graph that does not arise from a knot diag...
متن کاملStatistical and Dynamical Properties of Topological Polymers with Graphs and Ring Polymers with Knots
We review recent theoretical studies on the statistical and dynamical properties of polymers with nontrivial structures in chemical connectivity and those of polymers with a nontrivial topology, such as knotted ring polymers in solution. We call polymers with nontrivial structures in chemical connectivity expressed by graphs “topological polymers”. Graphs with no loop have only trivial topology...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 34 شماره
صفحات -
تاریخ انتشار 2000